Non-linear Optimization Methods for Learning Regular Distributions

نویسندگان

چکیده

Probabilistic finite automata (PFA) are recognizers of regular distributions over strings, a model that is widely applied in speech recognition and biological systems, for example. While the underlying structure PFA just normal automaton, it well known with non-deterministic more powerful than deterministic one. In this paper, we concentrate on passive learning from examples counterexamples using two steps procedure: first learn an algorithm residual state then probabilities states transitions three different optimization methods. We experimentally show set random probabilistic ones learned RFSA combined genetic optimizing weight outperforms other existing methods greatly improving distance to automaton be learned. also apply our behavior agent maze. Also here algorithms have better performance can both positive negative samples well.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-linear conjugate gradient methods for vector optimization∗

In this work, we propose non-linear conjugate gradient methods for finding critical points of vector-valued functions with respect to the partial order induced by a closed, convex, and pointed cone with non-empty interior. No convexity assumption is made on the objectives. The concepts of Wolfe and Zoutendjik conditions are extended for the vectorvalued optimization. In particular, we show that...

متن کامل

Non-Gaussian Methods for Learning Linear Structural Equation Models

Special thanks to Aapo Hyvärinen, Patrik O. Hoyer and Takashi Washio. 2 Abstract • Linear structural equation models (linear SEMs) can be used to model data generating processes of variables. • We review a new approach to learn or estimate linear structural equation models. • The new estimation approach utilizes non-Gaussianity of data for model identification and uniquely estimates much wider...

متن کامل

Generalization Error Estimation for Non-linear Learning Methods

Estimating the generalization error is one of the key ingredients of supervised learning since a good generalization error estimator can be used for model selection. An unbiased generalization error estimator called the subspace information criterion (SIC) is shown to be useful for model selection, but its range of application is limited to linear learning methods. In this paper, we extend SIC ...

متن کامل

Comparative Study of Particle Swarm Optimization and Genetic Algorithm Applied for Noisy Non-Linear Optimization Problems

Optimization of noisy non-linear problems plays a key role in engineering and design problems. These optimization problems can't be solved effectively by using conventional optimization methods. However, metaheuristic algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) seem very efficient to approach in these problems and became very popular. The efficiency of these ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2022

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-031-17244-1_4